Weak quasi-invexity of nonsmooth functions
نویسندگان
چکیده
منابع مشابه
Nonsmooth Multiobjective Fractional Programming with Generalized Invexity
In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient soluti...
متن کاملNonsmooth Continuous-Time Multiobjective Optimization Problems with Invexity
A few Karush-Kuhn-Tucker type of sufficient optimality conditions are given in this paper for nonsmooth continuous-time nonlinear multi-objective optimization problems in the Banach space L∞ [0, T ] of all n-dimensional vector-valued Lebesgue measurable functions which are essentially bounded, using Clarke regularity and generalized convexity. Further, we establish duality theorems for Wolfe an...
متن کاملOn a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity
and Applied Analysis 3 Definition 2.2 see 16 . Let ψ : R → R be a locally Lipschitz function, then ψ◦ u;v denotes Clarke’s generalized directional derivative of ψ at u ∈ R in the direction v and is defined as ψ◦ u;v lim sup y→u t→ 0 ψ ( y tv ) − ψ(y) t . 2.4 Clarke’s generalized gradient of ψ at u is denoted by ∂ψ u and is defined as ∂ψ u { ξ ∈ R | ψ◦ u;v ≥ 〈ξ, v〉, ∀v ∈ Rn}. 2.5 Let f : R → R b...
متن کاملWeak Pseudo-Invexity and Characterizations of Solutions in Multiobjective Programming
In this paper, we study Fritz John type optimality for nonlinear multiobjective programming problems under new classes of generalized invex vector functions. Relationships between these classes of vector functions are established by giving several examples. Furthermore, optimality conditions and characterizations of efficient and weakly efficient solutions are obtained under weak pseudoinvexity...
متن کاملA Quasi-Newton Approach to Nonsmooth Convex Optimization A Quasi-Newton Approach to Nonsmooth Convex Optimization
We extend the well-known BFGS quasi-Newton method and its limited-memory variant (LBFGS) to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by generalizing three components of BFGS to subdifferentials: The local quadratic model, the identification of a descent direction, and the Wolfe line search conditions. We apply the resulting subLBFGS algorithm to L2-reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2008
ISSN: 0893-9659
DOI: 10.1016/j.aml.2007.12.010